Lessons Learned from the CYK Algorithm for Parsing-based Verification of Hierarchical Plans

Verification of hierarchical plans deals with the problem whether an action sequence is causally consistent and can be obtained by a decomposition goal task. This second sub-problem (finding decomposition) makes verification NP-hard. The task structure very close to parsing tree context-free grammar (CFG). Recently, CFG-parsing algorithm Cocke–Younger–Kasami (CYK) has been modified verify efficiently. Despite being fast, only handle totally-ordered planning domains. In this paper, we ask ideas from CYK extended more general parsing-based approach that covers all domains, i.e., including partially ordered ones. More specifically, study effect modifying domain model limiting number sub-tasks in methods two changing strategy.